public class Text6 {
    // 153.寻找排序旋转数组中的最小值
    public int findMin(int[] nums) {
        int left = 0, right = nums.length - 1;
        int tmp = nums.length - 1;

        while(left < right){
            int mid = left + (right - left)/2;
            if(nums[mid] > nums[tmp])
                left = mid + 1;
            else
                right = mid;
        }

        return nums[left];
    }
}
